Fault Jumping Attacks against Shrinking Generator
نویسندگان
چکیده
In this paper we outline two cryptoanalytic attacks against hardware implementation of the shrinking generator by Coppersmith et al., a classic design in low-cost, simple-design pseudorandom bitstream generator. This is a report on work on progress, since implementation and careful adjusting the attack strategy in order to optimize the atatck is still not completed.
منابع مشابه
Fault Cryptanalysis and the Shrinking Generator
We present two efficient and simple fault attacks on the shrinking generator. In a first case if the attacker can stop control generator for some small number of steps and observe the output, then with high probability he can deduce the full control sequence, and so the other input bitstream. The second method assumes that the attacker can disturb the control sequence (in an unpredictable and r...
متن کاملRandom Fault Attack against Shrinking Generator
Requirements : data processed by a sensor network may require authentication of its source, protection against modifications, protection against unauthorized access. Examples : systems monitoring movements of people in a factory, at military instalations, at a nuclear plant,. .. systems monitoring pollution around a chemical plant. .. Problems : classical cryptography is too heavy in many cases...
متن کاملHow to Strengthen Pseudo-random Generators by Using Compression
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebraic attacks aimed at LFSR-based stream ciphers. Among such components are the Shrinking Generator and the Self-Shrinking Generator, as well as recent variations on Bit-Search-based decimation. We propose a general model...
متن کاملImproved Cryptoanalysis of the Self-shrinking P-adic Cryptographic Generator
The Self-shrinking p-adic cryptographic generator (SSPCG) is a fast software stream cipher. Improved cryptoanalysis of the SSPCG is introduced. This cryptoanalysis makes more precise the length of the period of the generator. The linear complexity and the cryptography resistance against most recently used attacks are invesigated. Then we discuss how such attacks can be avoided. The results show...
متن کاملThe (a, b)-Shrinking Generator
A new construction of a pseudorandom generator based on a simple combination of two LFSRs is introduced. This construction allows users to generate a large family of sequences using the same initial states and the same characteristic feedback polynomials of the two combined LFSRs. The construction is related to the so-called shrinking generator that is a special case of this construction. The c...
متن کامل